Generalized Parameterized Approximations
نویسنده
چکیده
We study generalized parameterized approximations, defined using both rough set theory and probability theory. The main objective is to study, for a given subset of the universe U , all such parameterized approximations, i.e., for all parameter values. For an approximation space (U,R), where R is an equivalence relation, there is only one type of such parameterized approximations. For an approximation space (U,R), where R is an arbitrary binary relation, three types of parameterized approximations are introduced in this paper: singleton, subset and concept. We show that the number of parameterized approximations of given type is not greater than the cardinality of U . Additionally, we show that singleton parameterized approximations are not useful for data mining, since such approximations, in general, are not even locally definable.
منابع مشابه
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the -reset-bounded approximation, the -bounded approximation, and the crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachabili...
متن کاملGeneralized Discrete Timed Automata: Decidable Approximations for Safety Verification
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the hB; ricrossing-bounded approximation), and derive automata-theoretic characterizations of the binary re...
متن کاملGeneralized discrete timed automata: decidable approximations for safety verificatio
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the -reset-bounded approximation, the -bounded approximation, and the crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachabili...
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملAnalysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
In this work, we present a generalized methodology for analyzing the convergence of quasioptimal Taylor and Legendre approximations, applicable to a wide class of parameterized elliptic PDEs with both deterministic and stochastic inputs. Such methods construct an index set ΛM that corresponds to the “best M -terms” based on sharp estimates of the polynomial coefficients. In particular, we consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011